112 research outputs found
Secure and Private Cloud Storage Systems with Random Linear Fountain Codes
An information theoretic approach to security and privacy called Secure And
Private Information Retrieval (SAPIR) is introduced. SAPIR is applied to
distributed data storage systems. In this approach, random combinations of all
contents are stored across the network. Our coding approach is based on Random
Linear Fountain (RLF) codes. To retrieve a content, a group of servers
collaborate with each other to form a Reconstruction Group (RG). SAPIR achieves
asymptotic perfect secrecy if at least one of the servers within an RG is not
compromised. Further, a Private Information Retrieval (PIR) scheme based on
random queries is proposed. The PIR approach ensures the users privately
download their desired contents without the servers knowing about the requested
contents indices. The proposed scheme is adaptive and can provide privacy
against a significant number of colluding servers.Comment: 8 pages, 2 figure
The Price of Updating the Control Plane in Information-Centric Networks
We are studying some fundamental properties of the interface between control
and data planes in Information-Centric Networks. We try to evaluate the traffic
between these two planes based on allowing a minimum level of acceptable
distortion in the network state representation in the control plane. We apply
our framework to content distribution, and see how we can compute the overhead
of maintaining the location of content in the control plane. This is of
importance to evaluate content-oriented network architectures: we identify
scenarios where the cost of updating the control plane for content routing
overwhelms the benefit of fetching a nearby copy. We also show how to minimize
the cost of this overhead when associating costs to peering traffic and to
internal traffic for operator-driven CDNs.Comment: 10 pages, 12 figure
Capacity of Cellular Networks with Femtocache
The capacity of next generation of cellular networks using femtocaches is
studied when multihop communications and decentralized cache placement are
considered. We show that the storage capability of future network User
Terminals (UT) can be effectively used to increase the capacity in random
decentralized uncoded caching. We further propose a random decentralized coded
caching scheme which achieves higher capacity results than the random
decentralized uncoded caching. The result shows that coded caching which is
suitable for systems with limited storage capabilities can improve the capacity
of cellular networks by a factor of log(n) where n is the number of nodes
served by the femtocache.Comment: 6 pages, 2 figures, presented at Infocom Workshops on 5G and beyond,
San Francisco, CA, April 201
- …